On geometrically realizable Möbius triangulations
نویسندگان
چکیده
منابع مشابه
On iterates of Möbius transformations on fields
Let p be a quadratic polynomial over a splitting field K, and S be the set of zeros of p. We define an associative and commutative binary relation on G ≡ K∪{∞}−S so that every Möbius transformation with fixed point set S is of the form x “plus” c for some c. This permits an easy proof of Aitken acceleration as well as generalizations of known results concerning Newton’s method, the secant metho...
متن کاملMöbius syndrome.
We describe a case of Möbius syndrome in a 3-month-old infant. Striking imaging findings of pontine hypoplasia in the region of the 6th and the 7th nerve complexes were noted. In addition, absence of the middle cerebellar peduncles was noted, a finding that, to our knowledge, has never been reported before in the literature. Clinical presentations, other radiologic findings, and a possible path...
متن کاملSequence Prediction in Realizable and Non-realizable Cases
A sequence x1, . . . , xn, . . . of discrete-valued observations is generated according to some unknown probabilistic law (measure) μ. After observing each outcome, it is required to give the conditional probabilities of the next observation. The realizable case is when the measure μ belongs to an arbitrary but known class C of process measures. The nonrealizable case is when μ is completely ar...
متن کاملAnalysis on Triangulations
We develop structures associated with triangulations which permit the application, directly to the vertices of a triangulation, of tools and processes normally restricted to continuous data, or at least data of sufficiently fine resolution and precision that the approximations of numerical analysis yield reasonable results. These structures include polynomial surfaces associated with, and refle...
متن کاملOn Hamiltonian Triangulations in
An n-vertex simple polygon P is said to have a Hamilto-nian Triangulation if it has a triangulation whose dual graph contains a Hamiltonian path. Such triangulations are useful in fast rendering engines in Computer Graphics. We give a new characterization of polygons with Hamiltonian triangulations. and use it to devise O(n log n)-time algorithms to recognize such polygons.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2012
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.06.007